Coiterative Morphisms: Interactive Equational Reasoning for Bisimulation, using Coalgebras
نویسندگان
چکیده
We study several techniques for interactive equational reasoning with the bisimulation equivalence. Our work is based on a modular library, formalised in Coq , that axiomatises weakly final coalgebras and bisimulation. As a theory we derive some coalgebraic schemes and an associated coinduction principle. This will help in interactive proofs by coinduction, modular derivation of congruence and co-fixed point equations and enables an extensional treatment of bisimulation. Finally we present a version of the λ-coinduction proof principle in our framework.
منابع مشابه
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems
We investigate the relation between the set-theoretical description of coinduction based on Tarski Fixpoint Theorem, and the categorical description of coinduction based on coalgebras. In particular, we examine set-theoretic generalizations of the coinduction proof principle, in the spirit of Milner's bisimulation \up-to", and we discuss categorical counterparts for these. Moreover, we investig...
متن کاملCovarieties of Coalgebras: Comonads and Coequations
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic morphisms, and subcoalgebras defined by split equalisers. A covariety has the stronger property of closure under all subcoalgebras, and is behavioural if it is closed under domains of morphisms, or equivalently under ima...
متن کاملEquational Axiomatizability for Coalgebra
A characterization result for equationally de nable classes of certain coalgebras (including basic hidden algebra) shows that a class of coalgebras is de nable by equations if and only if it is closed under coproducts, quotients, sources of morphisms and representative inclusions. The notions of equation and satisfaction are axiomatized in order to include the di erent approaches in the literat...
متن کاملA comonadic account of behavioural covarieties of coalgebras
A class K of coalgebras for an endofunctor T : Set→ Set is a behavioural covariety if it is closed under disjoint unions and images of bisimulation relations (hence closed under images and domains of coalgebraic morphisms, including subcoalgebras). K may be thought of as the class of all coalgebras that satisfy some computationally significant property. In any logical system suitable for specif...
متن کاملInformation Flow Analysis via Equational Reasoning
In this work, a process algebra is designed around an ACUID equational theory extended with prefixes symbolizing actions, and by making parallel synchronous composition distributive over non-deterministic choice; such a synchronous composition is commutative and non-associative. Bisimulation between processes is then interpretable as congruence over such an equational theory. It is shown that i...
متن کامل